Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Dominating set
• Independent set
• Vertex cover
• Connected dominating set
• Set cover problem
• Line graph
• Metric k-center
• Domatic number

December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in

Source URL: www.jsbi.org

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Clique
• Subgraph isomorphism problem
• Matching
• Protein kinase
• Protein
• Root-mean-square deviation of atomic positions

Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Universit´e Libre de Bruxelles Brussels, Belgium

Source URL: www.strc.ch

• Computational complexity theory
• Ant colony optimization algorithms
• Mathematics
• Ant
• Systems science
• Travelling salesman problem
• Argentine ant
• Stigmergy
• Pheromone
• Dalle Molle Institute for Artificial Intelligence Research
• Artificial ants
• Swarm intelligence

Solution Quality and Efficiency in Discrete Optimization 2 Scientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Mathematics
• Theory of computation
• Operations research
• NP-complete problems
• Mathematical optimization
• Convex optimization
• Travelling salesman problem
• Approximation algorithm
• Optimization problem
• Algorithm
• Genetic algorithm

The Inverse Problem of Seismic Velocities William W. Symes Computational and Applied Mathematics Rice University Agenda

Source URL: trip.rice.edu

On the Computational Complexity of ReoptimizationScientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Approximation algorithms
• NP-complete problems
• Complexity classes
• Theoretical computer science
• Travelling salesman problem
• APX
• Optimization problem
• Combinatorial optimization
• Genetic algorithm
• Heuristic
• Steiner tree problem

Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu

Source URL: www.scottaaronson.com

• Computational complexity theory
• Theory of computation
• Complexity classes
• Mathematical optimization
• Structural complexity theory
• Models of computation
• P versus NP problem
• NP
• Reduction
• Time complexity
• Oracle machine
• Low

Case Study Title: Combining problem solving and computational skills in physics: honing a new approach Author(s): Dr D I Westwood Department/School/Faculty/College: School of Physics and Astronomy Institution: Cardiff Un

Source URL: www.wimcs.ac.uk

CSL Technical Report SRI-CSL-06-01 • May 23, 2006 Integrating Simplex with DPLL(T ) Bruno Dutertre and Leonardo de Moura This report is based upon work supported by the Defense Advanced Research Projects

Source URL: yices.csl.sri.com

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Simplex algorithm

Inverse Problem in Quantitative Susceptibility Mapping (Day 2 - Talk 2) Jin Keun Seo* Department of Computational Science and Engineering, Yonsei University, Korea *Email of Presenting Author:

Source URL: ias.ust.hk